Multilevel Markov Chain Monte Carlo Method for High-Contrast Single-Phase Flow Problems

In this paper we propose a general framework for the uncertainty quantification of quantities of interest for high-contrast single-phase flow problems. It is based on the generalized multiscale finite element method (GMsFEM) and multilevel Monte Carlo (MLMC) methods. The former provides a hierarchy of approximations of different resolution, whereas the latter gives an efficient way to estimate quantities of interest using samples on different levels. The number of basis functions in the online GMsFEM stage can be varied to determine the solution resolution and the computational cost, and to efficiently generate samples at different levels. In particular, it is cheap to generate samples on coarse grids but with low resolution, and it is expensive to generate samples on fine grids with high accuracy. By suitably choosing the number of samples at different levels, one can leverage the expensive computation in larger fine-grid spaces toward smaller coarse-grid spaces, while retaining the accuracy of the final Monte Carlo estimate. Further, we describe a multilevel Markov chain Monte Carlo method, which sequentially screens the proposal with different levels of approximations and reduces the number of evaluations required on fine grids, while combining the samples at different levels to arrive at an accurate estimate. The framework seamlessly integrates the multiscale features of the GMsFEM with the multilevel feature of the MLMC methods following the work in \cite{ketelson2013}, and our numerical experiments illustrate its efficiency and accuracy in comparison with standard Monte Carlo estimates.Comment: 29 pages, 6 figure

Generalized Multiscale Finite Element Methods (GMsFEM

In this paper we use the Generalized Multiscale Finite Element Method (GMsFEM) framework, introduced in [20], in order to solve nonlinear elliptic equations with high-contrast coefficients. The proposed solution method involves linearizing the equation so that coarse-grid quantities of previous solution iterates can be regarded as auxiliary parameters within the problem formulation. With this convention, we systematically construct respective coarse solution spaces that lend themselves to either continuous Galerkin (CG) or discontinuous Galerkin (DG) global formulations. Here, we use Symmetric Interior Penalty Discontinuous Galerkin approach. Both methods yield a predictable error decline that depends on the respective coarse space dimension, and we illustrate the effectiveness of the CG and DG formulations by offering a variety of numerical examples

Abstract

In this paper, we propose oversampling strategies in the Generalized Multiscale Finite Element Method (GMsFEM) framework. The GMsFEM, which has been recently introduced in [12], allows solving multiscale parameter-dependent problems at a reduced computational cost by constructing a reduced-order representation of the solution on a coarse grid. The main idea of the method consists of (1) the construction of snapshot space, (2) the construction of the offline space, and (3) construction of the online space (the latter for parameter-dependent problems). In [12], it was shown that the GMsFEM provides a flexible tool to solve multiscale problems with a complex input space by generating appropriate snapshot, offline, and online spaces. In this paper, we develop oversampling techniques to be used in this context (see [19] where oversampling is introduced for multiscale finite element methods). It is known (see [19]) that the oversampling can improve the accuracy of multiscale methods. In particular, the oversampling technique uses larger regions (larger than the target coarse block) in constructing local basis functions. Our motivation stems from the analysis presented in this paper which show that when using oversampling techniques in the construction of the snapshot space and offline space, GMsFEM will converge independent of small scales and high-contrast under certain assumptions. We consider the use of multiple eigenvalue problem to improve the convergence and discuss their relation to single spectral problems that use oversampled regions. The oversampling procedures proposed in thi